Computing integral points on hyperelliptic curves using quadratic Chabauty
نویسندگان
چکیده
منابع مشابه
Integral Points on Hyperelliptic Curves
Let C : Y 2 = anX + · · · + a0 be a hyperelliptic curve with the ai rational integers, n ≥ 5, and the polynomial on the right irreducible. Let J be its Jacobian. We give a completely explicit upper bound for the integral points on the model C, provided we know at least one rational point on C and a Mordell–Weil basis for J(Q). We also explain a powerful refinement of the Mordell–Weil sieve whic...
متن کاملp-ADIC HEIGHT PAIRINGS AND INTEGRAL POINTS ON HYPERELLIPTIC CURVES
We give a formula for the component at p of the p-adic height pairing of a divisor of degree 0 on a hyperelliptic curve. We use this to give a Chabauty-like method for finding p-adic approximations to p-integral points on such curves when the Mordell-Weil rank of the Jacobian equals the genus. In this case we get an explicit bound for the number of such p-integral points, and we are able to use...
متن کاملComputing Integral Points on Elliptic Curves
By a famous theorem of Siegel [S], the number of integral points on an elliptic curve E over an algebraic number field K is finite. A conjecture of Lang and Demjanenko [L3] states that, for a quasiminimal model of E over K, this number is bounded by a constant depending only on the rank of E over K and on K (see also [HSi], [Zi4]). This conjecture was proved by Silverman [Si1] for elliptic curv...
متن کاملComputing S-Integral Points on Elliptic Curves
1. Introduction. By a famous theorem of Siegel [S], the number of integral points on an elliptic curve E over an algebraic number field K is finite. A conjecture of Lang and Demyanenko (see [L3], p. 140) states that, for a quasiminimal model of E over K, this number is bounded by a constant depending only on the rank of E over K and on K (see also [HSi], [Zi4]). This conjecture was proved by Si...
متن کاملOn quadratic residue codes and hyperelliptic curves
For an odd prime p and each non-empty subset S ⊂ GF (p), consider the hyperelliptic curve XS defined by y = fS(x), where fS(x) = Q a∈S(x− a). Using a connection between binary quadratic residue codes and hyperelliptic curves over GF (p), this paper investigates how coding theory bounds give rise to bounds such as the following example: for all sufficiently large primes p there exists a subset S...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2016
ISSN: 0025-5718,1088-6842
DOI: 10.1090/mcom/3130